47 research outputs found

    Spectra of large time-lagged correlation matrices from Random Matrix Theory

    Full text link
    We analyze the spectral properties of large, time-lagged correlation matrices using the tools of random matrix theory. We compare predictions of the one-dimensional spectra, based on approaches already proposed in the literature. Employing the methods of free random variables and diagrammatic techniques, we solve a general random matrix problem, namely the spectrum of a matrix 1TXAX\frac{1}{T}XAX^{\dagger}, where XX is an N×TN\times T Gaussian random matrix and AA is \textit{any} T×TT\times T, not necessarily symmetric (Hermitian) matrix. As a particular application, we present the spectral features of the large lagged correlation matrices as a function of the depth of the time-lag. We also analyze the properties of left and right eigenvector correlations for the time-lagged matrices. We positively verify our results by the numerical simulations.Comment: 44 pages, 11 figures; v2 typos corrected, final versio

    Probing non-orthogonality of eigenvectors in non-Hermitian matrix models: diagrammatic approach

    Get PDF
    Using large NN arguments, we propose a scheme for calculating the two-point eigenvector correlation function for non-normal random matrices in the large NN limit. The setting generalizes the quaternionic extension of free probability to two-point functions. In the particular case of biunitarily invariant random matrices, we obtain a simple, general expression for the two-point eigenvector correlation function, which can be viewed as a further generalization of the single ring theorem. This construction has some striking similarities to the freeness of the second kind known for the Hermitian ensembles in large NN. On the basis of several solved examples, we conjecture two kinds of microscopic universality of the eigenvectors - one in the bulk, and one at the rim. The form of the conjectured bulk universality agrees with the scaling limit found by Chalker and Mehlig [JT Chalker, B Mehlig, PRL, \textbf{81}, 3367 (1998)] in the case of the complex Ginibre ensemble.Comment: 20 pages + 4 pages of references, 12 figs; v2: typos corrected, refs added; v3: more explanator

    Universal transient behavior in large dynamical systems on networks

    Full text link
    We analyze how the transient dynamics of large dynamical systems in the vicinity of a stationary point, modeled by a set of randomly coupled linear differential equations, depends on the network topology. We characterize the transient response of a system through the evolution in time of the squared norm of the state vector, which is averaged over different realizations of the initial perturbation. We develop a mathematical formalism that computes this quantity for graphs that are locally tree-like. We show that for unidirectional networks the theory simplifies and general analytical results can be derived. For example, we derive analytical expressions for the average squared norm for random directed graphs with a prescribed degree distribution. These analytical results reveal that unidirectional systems exhibit a high degree of universality in the sense that the average squared norm only depends on a single parameter encoding the average interaction strength between the individual constituents. In addition, we derive analytical expressions for the average squared norm for unidirectional systems with fixed diagonal disorder and with bimodal diagonal disorder. We illustrate these results with numerical experiments on large random graphs and on real-world networks.Comment: 19 pages, 7 figures. Substantially enlarged version. Submitted to Physical Review Researc

    Narain transform for spectral deformations of random matrix models

    Get PDF
    We start from applying the general idea of spectral projection (suggested by Olshanski and Borodin and advocated by Tao) to the complex Wishart model. Combining the ideas of spectral projection with the insights from quantum mechanics, we derive in an effortless way all spectral properties of the complex Wishart model: first, the Marchenko-Pastur distribution interpreted as a Bohr-Sommerfeld quantization condition for the hydrogen atom; second, hard (Bessel), soft (Airy) and bulk (sine) microscopic kernels from properly rescaled radial Schrödinger equation for the hydrogen atom. Then, generalizing the ideas based on Schrödinger equation to the case when Hamiltonian is non-Hermitian, we propose an analogous construction for spectral projections of universal kernels for bi-orthogonal ensembles. In particular, we demonstrate that the Narain transform is a natural extension of the Hankel transform for the products of Wishart matrices, yielding an explicit form of the universal kernel at the hard edge. We also show how the change of variables of the rescaled kernel allows us to make the link to the universal kernel of the Muttalib-Borodin ensemble. The proposed construction offers a simple alternative to standard methods of derivation of microscopic kernels. Finally, we speculate, that a suitable extension of the Bochner theorem for Sturm-Liouville operators may provide an additional insight into the classification of microscopic universality classes in random matrix theory

    Condition numbers for real eigenvalues in the real Elliptic Gaussian ensemble

    Get PDF
    We study the distribution of the eigenvalue condition numbers κi=(lili)(riri)\kappa_i=\sqrt{ (\mathbf{l}_i^* \mathbf{l}_i)(\mathbf{r}_i^* \mathbf{r}_i)} associated with real eigenvalues λi\lambda_i of partially asymmetric N×NN\times N random matrices from the real Elliptic Gaussian ensemble. The large values of κi\kappa_i signal the non-orthogonality of the (bi-orthogonal) set of left li\mathbf{l}_i and right ri\mathbf{r}_i eigenvectors and enhanced sensitivity of the associated eigenvalues against perturbations of the matrix entries. We derive the general finite NN expression for the joint density function(JDF) PN(z,t){\cal P}_N(z,t) of t=κi21t=\kappa_i^2-1 and λi\lambda_i taking value zz, and investigate its several scaling regimes in the limit NN\to \infty. When the degree of asymmetry is fixed as NN\to \infty, the number of real eigenvalues is O(N)O(\sqrt{N}), and in the bulk of the real spectrum ti=O(N)t_i=O(N), while on approaching the spectral edges the non-orthogonality is weaker: ti=O(N)t_i=O(\sqrt{N}). In both cases the corresponding JDFs, after appropriate rescaling, coincide with those found in the earlier studied case of fully asymmetric (Ginibre) matrices. A different regime of weak asymmetry arises when a finite fraction of NN eigenvalues remain real as NN\to \infty. In such a regime eigenvectors are weakly non-orthogonal, t=O(1)t=O(1), and we derive the associated JDF, finding that the characteristic tail P(z,t)t2{\cal P}(z,t)\sim t^{-2} survives for arbitrary weak asymmetry. As such, it is the most robust feature of the condition number density for real eigenvalues of asymmetric matrices.Comment: 20 pages, 2 figures; to appear in Annales Henri Poincar

    Universal spectra of random Lindblad operators

    Full text link
    To understand typical dynamics of an open quantum system in continuous time, we introduce an ensemble of random Lindblad operators, which generate Markovian completely positive evolution in the space of density matrices. Spectral properties of these operators, including the shape of the spectrum in the complex plane, are evaluated by using methods of free probabilities and explained with non-Hermitian random matrix models. We also demonstrate universality of the spectral features. The notion of ensemble of random generators of Markovian qauntum evolution constitutes a step towards categorization of dissipative quantum chaos.Comment: 6 pages, 4 figures + supplemental materia

    Unveiling the significance of eigenvectors in diffusing non-hermitian matrices by identifying the underlying Burgers dynamics

    Get PDF
    Following our recent letter, we study in detail an entry-wise diffusion of non-hermitian complex matrices. We obtain an exact partial differential equation (valid for any matrix size NN and arbitrary initial conditions) for evolution of the averaged extended characteristic polynomial. The logarithm of this polynomial has an interpretation of a potential which generates a Burgers dynamics in quaternionic space. The dynamics of the ensemble in the large NN is completely determined by the coevolution of the spectral density and a certain eigenvector correlation function. This coevolution is best visible in an electrostatic potential of a quaternionic argument built of two complex variables, the first of which governs standard spectral properties while the second unravels the hidden dynamics of eigenvector correlation function. We obtain general large NN formulas for both spectral density and 1-point eigenvector correlation function valid for any initial conditions. We exemplify our studies by solving three examples, and we verify the analytic form of our solutions with numerical simulations.Comment: 24 pages, 11 figure

    Dynamical Isometry is Achieved in Residual Networks in a Universal Way for any Activation Function

    Full text link
    We demonstrate that in residual neural networks (ResNets) dynamical isometry is achievable irrespectively of the activation function used. We do that by deriving, with the help of Free Probability and Random Matrix Theories, a universal formula for the spectral density of the input-output Jacobian at initialization, in the large network width and depth limit. The resulting singular value spectrum depends on a single parameter, which we calculate for a variety of popular activation functions, by analyzing the signal propagation in the artificial neural network. We corroborate our results with numerical simulations of both random matrices and ResNets applied to the CIFAR-10 classification problem. Moreover, we study the consequence of this universal behavior for the initial and late phases of the learning processes. We conclude by drawing attention to the simple fact, that initialization acts as a confounding factor between the choice of activation function and the rate of learning. We propose that in ResNets this can be resolved based on our results, by ensuring the same level of dynamical isometry at initialization
    corecore